Segregated Binary Trees: Decoupling Memory Manager
نویسندگان
چکیده
Dynamic memory management is important and essential to the operation of a computer system. Efficient memory allocation, garbage collection and compaction are becoming increasingly critical in parallel, distributed and real-time applications using object-oriented languages like C++ and Java. In addition to achieving fast allocation/deallocation of memory objects, memory management techniques should strive to achieve low fragmentation and high storage utilization. Recently, we have proposed a memory management technique (Segregated Binary Tree) and reported data on its performance both in terms of storage utilization and execution speed. In this paper, we present how to exploit Intelligent Memory Devices to decouple the memory management from the central processing unit, and show how Segregated Binary Trees can be embedded in Intelligent Memory devices.
منابع مشابه
Segregated Binary Trees: Address-Ordered Binary Trees Revisited
Dynamic memory management has been an active research area for the last four decades. The primary goals of any memory management technique are the speed of allocation & delloaction; and efficient storage utilization. In this paper, we introduce two new memory allocation techniques: Address Ordered Binary Trees (ABT) and Segregated Binary Trees (SBT). Our empirical results show how Address Order...
متن کاملUtilizing Separate Caches: Eliminate Cache Pollution Caused By Memory Manager
Data intensive service functions such as memory allocation/de-allocation, data prefetching, and data relocation can pollute processor cache in conventional systems since the same CPU (using the same cache) executes both application code and system services. In this paper we show the improvements in cache performance that can result from the elimination of the cache pollution using separate cach...
متن کاملCache-sensitive Memory Layout for Binary Trees
We improve the performance of main-memory binary search trees (including AVL and red-black trees) by applying cache-sensitive and cacheoblivious memory layouts. We relocate tree nodes in memory according to a multi-level cache hierarchy, also considering the conflict misses produced by set-associative caches. Moreover, we present a method to improve onelevel cache-sensitivity without increasing...
متن کاملDecoupling Persistence Services from DBMS Buffer Management
Advances in DRAM technology and, in turn, substantial cost reduction for volatile memory in recent years require an evolution of database system architectures to take full benefit of large buffer pools. Having huge memory sizes, an up-to-date version of database pages on stable storage is more than ever necessary to support fast and effective crash recovery. In this contribution, we consider im...
متن کاملA New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity
Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000